Geodesic Voronoi Diagrams on Parametric Surfaces
نویسندگان
چکیده
In this paper we will extend the concept of Voronoi diagrams to parameterized surfuces where distance between two points is defined as infimum over the lengths of surface paths connecting these points. We will present a method to compute Voronoi diagrams on these surfuces.
منابع مشابه
Exact Implementation of Arrangements of Geodesic Arcs on the Sphere with Applications
Recently, the Arrangement 2 package of Cgal, the Computational Geometry Algorithms Library, has been greatly extended to support arrangements of curves embedded on two-dimensional parametric surfaces. The general framework for sweeping a set of curves embedded on a two-dimensional parametric surface was introduced in [3]. In this paper we concentrate on the specific algorithms and implementatio...
متن کاملThe Duality of Geodesic Voronoi/Delaunay Diagrams For An Intrinsic Discrete Laplace-Beltrami Operator on Simplicial Surfaces
An intrinsic discrete Laplace-Beltrami operator on simplicial surfaces S proposed in [2] was established via an intrinsic Delaunay tessellation on S. Up to now, this intrinsic Delaunay tessellations can only be computed by an edge flipping algorithm without any provable complexity analysis. In the paper, we show that the intrinsic Delaunay triangulation can be obtained from a duality of geodesi...
متن کاملHigher-order Voronoi diagrams on triangulated surfaces
We study the complexity of higher-order Voronoi diagrams on triangulated surfaces under the geodesic distance, when the sites may be polygonal domains of constant complexity. More precisely, we show that on a surface defined by n triangles the sum of the combinatorial complexities of the order-j Voronoi diagrams of m sites, for j = 1, . . . , k, is O(kn + km+ knm), which is asymptotically tight...
متن کاملThe complexity of geodesic Voronoi diagrams on triangulated 2-manifold surfaces
We study the combinatorial complexity of Voronoi diagram of point sites on a general triangulated 2-manifold surface, based on the geodesic metric. Given a triangulated 2-manifold T of n faces and a set of m point sites S = {s1, s2, · · · , sm} ∈ T , we prove that the complexity of Voronoi diagram VT (S) of S on T is O(mn) if the genus of T is zero. For a genus-g manifold T in which the samples...
متن کاملHigher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes
We investigate the higher-order Voronoi diagrams of n point sites with respect to the geodesic distance in a simple polygon with h > 0 polygonal holes and c corners. Given a set of n point sites, the korder Voronoi diagram partitions the plane into several regions such that all points in a region share the same k nearest sites. The nearest-site (first-order) geodesic Voronoi diagram has already...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997